Tangles, tree-decompositions and grids in matroids
نویسندگان
چکیده
Article history: Received 8 September 2004 Available online 8 April 2009
منابع مشابه
Tangle-tree duality: in graphs, matroids and beyond⇤
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data sets. Our applications to graphs include new, tangle-type, duality theorems for tree-width, path-width, and tree-decompositions of small adhesion. Conversel...
متن کاملLINKED TREE-DECOMPOSITIONS OF INFINITE REPRESENTED MATROIDS By
It is natural to try to extend the results of Robertson and Seymour’s Graph Minors Project to other objects. As linked tree-decompositions (ltds) of graphs played a key role in the Graph Minors Project, establishing the existence of ltds of other objects is a useful step towards such extensions. There has been progress in this direction for both infinite graphs and matroids. Kříž and Thomas pro...
متن کاملTangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles)
We survey an abstract theory of connectivity, based on symmetric submodular set functions. We start by developing Robertson and Seymour’s [44] fundamental duality theory between branch decompositions (related to the better-known tree decompositions) and so-called tangles, which may be viewed as highly connected regions in a connectivity system. We move on to studying canonical decompositions of...
متن کاملA short proof that every finite graph has a tree-decomposition displaying its tangles
We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to matroids is due to Geelen, Gerards and Whittle.
متن کاملCanonical tree-decompositions of finite graphs I. Existence and algorithms
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject to the requirement that they commute with graph isomorphisms. In particular, all the decompositions constructed are invariant under the automorphisms of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 99 شماره
صفحات -
تاریخ انتشار 2009